An Algorithm for the Hierarchical Organization of Path Diagrams and Calculation of Components of Expected Covariance
نویسندگان
چکیده
Modern structural equation modeling software programs include user interfaces for the entry of graphical diagrams as a method for the production of the underlying matrices that are then manipulated in traditional ways to provide parameter estimates and fit statistics. This work presents an algorithm for the solution of the problem in the reverse order: automatically producing a graphical diagram from a matrix formula in such a way that its components are logically and hierarchically arranged. In the process, the individual path components of expected covariance between variables are calculated and feedback loops or so–called nonrecursive paths are recognized and tagged. Possible uses for this algorithm include automatic recognition of regions of structural underidentification in a model and the didactic graphical display of the components of expected covariance between variables. This algorithm relies on the matrix equations of McArdle and McDonald (1984), a general purpose SEM formulation. This work was supported in part by a grant from the National Institute on Aging (1-R29AG1498301A1). Splus code that implements a version of the algorithm presented in this article can be downloaded from http://www.nd.edu/ ̃ sboker/ ALGORITHM FOR THE ORGANIZATION OF PATH DIAGRAMS 2
منابع مشابه
Mobile Robot Online Motion Planning Using Generalized Voronoi Graphs
In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...
متن کاملNear-Minimum-Time Motion Planning of Manipulators along Specified Path
The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملTestability Guided Hierarchical Test Generation with Decision Diagrams
A unified approach is presented for calculation multi-level testability measures and for testability guided hierarchical automated test pattern generation (ATPG) for digital systems. The methods and algorithms are based on path tracing procedures on decision diagrams. On the higher level the system is presented as a network of register transfer level (RTL) components, and on the lower level eac...
متن کاملOptimal Observer Path Planning For Bearings-Only Moving Targets Tracking Using Chebyshev Polynomials
In this paper, an optimization problem for the observer trajectory in the bearings-only surface moving target tracking (BOT) is studied. The BOT depends directly on the observability of the target's position in the target/observer geometry or the optimal observer maneuver. Therefore, the maximum lower band of the Fisher information matrix is opted as an independent criterion of the target estim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001